Approximate Feasibility Analysis and Response-Time Bounds of Static-Priority Tasks with Release Jitters

We consider static-priority tasks with constraineddeadlines that are subjected to release jitter. We define an approximate worst-case response-time analysis and propose a polynomial-time algorithm. For that purpose, we extend the Fully Polynomial-Time Approximation Scheme (FPTAS) presented in [6] to take into account release jitter constraints; this feasibility test is then used to define a polynomial time algorithm that approximate worst-case response times of tasks. Nevertheless, the approximate worst-case response time values have not been proved to have any bounded error in comparison with worstcase response times computed by an exact algorithm (with pseudo-polynomial time complexity).